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 11, 2026 13:32wnwnScore: 4,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 13:324,22455,641,35633,053,0002,003,0002,494,464
2Apr 11, 2026 13:324,22457,780,28333,054,0002,003,0002,502,656
3Apr 11, 2026 13:324,22757,020,50933,077,0002,004,0002,490,368
4Apr 11, 2026 13:324,23658,871,19833,148,0002,008,0002,498,560
5Apr 11, 2026 13:324,23961,826,53533,171,0002,010,0002,531,328
6Apr 11, 2026 13:324,24562,475,26333,223,0002,013,0002,277,376