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 listApr 1, 2026 01:12zielajzielajScore: 3,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 01:123,40755,410,65827,268,0001,009,0002,445,312
2Apr 1, 2026 01:143,40954,435,81027,284,0001,010,0002,519,040
3Apr 1, 2026 01:123,41149,076,04827,304,0001,011,0002,433,024
4Apr 1, 2026 01:143,41147,195,37127,301,0001,011,0002,433,024
5Apr 1, 2026 01:123,41753,041,87927,345,0001,012,0002,424,832
6Apr 1, 2026 01:143,42852,702,31327,433,0001,016,0002,527,232