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 27, 2026 10:24wnwnScore: 3,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:253,44243,936,92927,556,0001,020,0002,490,368
2Apr 27, 2026 10:253,45044,163,64927,617,0001,022,0002,486,272
3Apr 27, 2026 10:253,45245,368,60827,631,0001,023,0002,486,272
4Apr 27, 2026 10:253,48143,310,39226,906,0001,993,0002,486,272
5Apr 27, 2026 10:253,51246,135,80728,148,0001,005,0002,490,368
6Apr 27, 2026 10:253,61344,778,63827,994,0001,999,0002,490,368
7Apr 27, 2026 10:253,62743,702,36329,104,0001,003,0002,490,368
8Apr 27, 2026 10:253,63547,351,07029,169,0001,005,0002,482,176
9Apr 27, 2026 10:253,66247,293,16329,384,0001,013,0002,490,368