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 26, 2026 13:59wnwnScore: 3,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:103,39443,359,46527,166,0001,006,0002,490,368
2Apr 26, 2026 14:103,40748,455,77327,273,0001,010,0002,486,272
3Apr 26, 2026 14:103,42545,999,82227,418,0001,015,0002,482,176
4Apr 26, 2026 14:103,43146,679,09627,466,0001,017,0002,486,272
5Apr 26, 2026 14:103,44545,724,19627,578,0001,021,0002,482,176
6Apr 26, 2026 14:103,46644,133,68526,785,0001,984,0002,494,464
7Apr 26, 2026 14:103,58845,582,94928,757,0001,027,0002,486,272
8Apr 26, 2026 14:103,61646,100,83628,013,0002,000,0002,482,176
9Apr 26, 2026 14:103,63745,120,56429,183,0001,006,0002,486,272