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 listSep 13, 2026 23:50drewbumpasdrewbumpasScore: 520,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 23:51520,1584,327,668,2974,254,212,00063,102,0002,113,536
2Sep 13, 2026 23:51520,2274,328,074,3634,254,844,00063,045,0002,113,536
3Sep 13, 2026 23:51520,4064,329,581,2254,257,320,00062,056,0002,113,536
4Sep 13, 2026 23:51520,4694,330,118,9494,257,853,00062,045,0002,113,536
5Sep 13, 2026 23:51520,5694,330,917,9164,257,473,00063,255,0002,113,536
6Sep 13, 2026 23:51520,8064,332,976,2794,260,643,00062,050,0002,113,536
7Sep 13, 2026 23:51527,6214,389,588,8744,315,961,00063,299,0002,113,536
8Sep 13, 2026 23:51528,2114,394,410,3174,322,107,00062,050,0002,113,536
9Sep 13, 2026 23:51528,6434,398,441,9674,324,693,00063,050,0002,113,536