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 6, 2026 08:24flavio87flavio87Score: 16,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 08:2416,568154,343,865135,352,0002,163,0002,371,584
2May 6, 2026 08:2416,656157,084,679136,096,0002,151,0002,392,064
3May 6, 2026 08:2416,666155,136,298136,168,0002,168,0002,420,736
4May 6, 2026 08:2416,716155,761,518136,561,0002,190,0002,404,352
5May 6, 2026 08:2416,742158,276,168136,782,0002,180,0002,408,448
6May 6, 2026 08:2416,756153,543,151136,929,0002,149,0002,420,736
7May 6, 2026 08:2416,795157,740,581137,349,0002,050,0002,428,928
8May 6, 2026 08:2416,816156,125,740137,515,0002,065,0002,433,024
9May 6, 2026 08:2416,822157,795,515137,470,0002,155,0002,437,120