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 listAug 1, 2026 10:55George SeabridgeGeorge SeabridgeScore: 9,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 10:558,31178,937,60267,901,0001,082,0002,113,536
2Aug 1, 2026 10:558,31579,009,09967,941,0001,079,0002,113,536
3Aug 1, 2026 10:559,63590,782,43178,888,0001,087,0002,113,536
4Aug 1, 2026 10:559,66490,389,29979,119,0001,095,0002,113,536
5Aug 1, 2026 10:559,67290,295,28379,182,0001,102,0002,113,536
6Aug 1, 2026 10:559,68190,314,96579,256,0001,097,0002,113,536
7Aug 1, 2026 10:559,69391,811,69579,188,0001,266,0002,113,536
8Aug 1, 2026 10:559,69490,467,43579,372,0001,092,0002,113,536
9Aug 1, 2026 10:559,99592,898,46581,939,0001,027,0002,113,536