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 17, 2025 12:39RyogaRyogaScore: 183,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2025 12:39183,0561,542,454,6201,306,452,000212,910,0002,424,832
2Oct 17, 2025 12:39183,4311,551,374,3171,308,554,000213,927,0002,338,816
3Oct 17, 2025 12:39184,0761,555,692,0141,306,999,000220,830,0002,322,432