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 07:51wnwnScore: 3,483Success
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 07:513,43245,402,96027,471,0001,017,0002,486,272
2Apr 27, 2026 07:513,43350,482,58727,485,0001,017,0002,494,464
3Apr 27, 2026 07:513,43648,432,29927,509,0001,018,0002,494,464
4Apr 27, 2026 07:513,44050,346,07827,536,0001,019,0002,494,464
5Apr 27, 2026 07:513,48344,484,94426,920,0001,994,0002,486,272
6Apr 27, 2026 07:513,51842,908,09528,199,0001,007,0002,486,272
7Apr 27, 2026 07:513,53147,167,94828,305,0001,010,0002,490,368
8Apr 27, 2026 07:513,60346,538,48027,919,0001,994,0002,490,368
9Apr 27, 2026 07:513,64446,432,88729,243,0001,008,0002,326,528