Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 29, 2025 21:51Alexander KovalyovAlexander KovalyovScore: 529,877Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 21:51529,1774,417,697,7804,319,214,00072,952,0002,277,376
2Oct 29, 2025 21:51529,4184,418,702,2054,335,210,00058,962,0002,269,184
3Oct 29, 2025 21:51529,5234,423,552,0874,326,090,00068,953,0002,277,376
4Oct 29, 2025 21:51529,8424,421,630,4184,333,719,00063,966,0002,277,376
5Oct 29, 2025 21:51529,8774,430,387,2984,332,025,00065,954,0002,285,568
6Oct 29, 2025 21:51529,8774,422,662,9664,325,030,00072,949,0002,285,568
7Oct 29, 2025 21:51530,1274,432,502,4874,327,086,00072,967,0002,260,992
8Oct 29, 2025 21:51533,8324,459,209,3274,346,866,00083,939,0002,285,568
9Oct 29, 2025 21:51538,8904,497,059,7944,408,830,00063,954,0002,285,568