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 listMay 10, 2026 10:01wnwnScore: 3,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:013,38842,440,96027,080,0001,048,0002,486,272
2May 10, 2026 10:013,40140,313,65927,191,0001,041,0002,478,080
3May 10, 2026 10:013,42642,782,81327,399,0001,044,0002,486,272
4May 10, 2026 10:013,51544,482,30528,077,0001,102,0002,486,272
5May 10, 2026 10:013,52244,553,93028,163,0001,076,0002,482,176
6May 10, 2026 10:013,52544,307,15428,210,0001,055,0002,478,080
7May 10, 2026 10:013,53043,408,02228,214,0001,093,0002,478,080
8May 10, 2026 10:013,55846,422,75028,446,0001,090,0002,490,368
9May 10, 2026 10:013,57048,023,66228,567,0001,070,0002,486,272