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 6, 2026 03:45janwwwjanwwwScore: 81,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 03:4681,542687,297,770615,231,00061,575,00020,480
2Oct 6, 2026 03:4681,549687,298,226615,231,00061,627,00020,480
3Oct 6, 2026 03:4681,561687,472,454615,294,00061,670,00020,480
4Oct 6, 2026 03:4681,580687,616,886615,671,00061,446,00020,480
5Oct 6, 2026 03:4681,586687,678,093615,362,00061,807,00020,480
6Oct 6, 2026 03:4681,591687,724,167615,590,00061,623,00020,480
7Oct 6, 2026 03:4681,596687,704,222615,232,00062,016,00020,480
8Oct 6, 2026 03:4681,631687,992,529615,820,00061,725,00020,480
9Oct 6, 2026 03:4681,643688,469,239615,641,00061,996,00020,480