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 listMar 17, 2026 10:11limanjun99limanjun99Score: 6,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 10:116,30274,946,99751,298,0001,005,0002,289,664
2Mar 17, 2026 10:116,31777,264,99150,412,0002,016,0002,289,664
3Mar 17, 2026 10:116,31773,999,99050,411,0002,016,0002,342,912
4Mar 17, 2026 10:116,32078,766,89249,428,0003,026,0002,351,104
5Mar 17, 2026 10:116,32183,762,56050,450,0002,018,0002,289,664
6Mar 17, 2026 10:116,32478,978,83150,468,0002,018,0002,289,664
7Mar 17, 2026 10:116,32574,896,47548,457,0004,038,0002,498,560
8Mar 17, 2026 10:116,33782,461,37949,564,0003,034,0002,498,560
9Mar 17, 2026 10:116,36180,026,67050,805,0001,992,0002,334,720