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 18, 2026 10:23shartgepettoshartgepettoScore: 6,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 10:236,08971,013,00547,507,0003,032,0002,478,080
2Mar 18, 2026 10:236,09377,770,36946,527,0004,045,0002,392,064
3Mar 18, 2026 10:236,12279,062,45846,830,0003,985,0002,469,888
4Mar 18, 2026 10:236,14978,123,43849,038,0002,001,0002,396,160
5Mar 18, 2026 10:236,16479,171,19448,156,0003,009,0002,355,200
6Mar 18, 2026 10:236,17374,668,26047,220,0004,018,0002,371,584
7Mar 18, 2026 10:236,22783,010,83048,642,0003,040,0002,473,984
8Mar 18, 2026 10:236,24582,824,49947,849,0003,987,0002,400,256
9Mar 18, 2026 10:236,32475,164,56750,469,0002,018,0002,387,968