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 listJul 27, 2025 03:57Serendipity1902Serendipity1902Score: 77,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 03:5777,326663,722,519581,822,00059,981,0002,531,328
2Jul 27, 2025 03:5777,362668,999,724583,097,00059,009,0002,269,184
3Jul 27, 2025 03:5777,368668,819,583586,145,00056,013,0002,531,328
4Jul 27, 2025 03:5777,415671,645,906586,586,00055,960,0002,453,504
5Jul 27, 2025 03:5777,465666,298,888584,961,00057,996,0002,531,328
6Jul 27, 2025 03:5777,585665,904,801583,962,00059,996,0002,445,312
7Jul 27, 2025 03:5777,630667,891,795584,297,00060,030,0002,412,544
8Jul 27, 2025 03:5777,676670,192,380583,738,00060,972,0002,445,312
9Jul 27, 2025 03:5777,684672,729,208582,801,00061,978,0002,269,184