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 listMar 31, 2026 22:54zielajzielajScore: 3,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 22:543,40750,925,13127,267,0001,009,0002,437,120
2Apr 1, 2026 00:043,42752,490,56127,426,0001,015,0002,510,848
3Apr 1, 2026 00:043,42850,154,29427,435,0001,016,0002,437,120
4Mar 31, 2026 22:543,43052,315,73427,455,0001,016,0002,441,216
5Apr 1, 2026 00:043,43447,927,44327,486,0001,018,0002,437,120
6Mar 31, 2026 22:543,49953,156,07727,041,0002,003,0002,519,040