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 2, 2026 20:56George SeabridgeGeorge SeabridgeScore: 5,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:575,54455,902,35043,795,0002,223,0002,113,536
2Aug 2, 2026 20:575,54456,578,40543,741,0002,279,0002,113,536
3Aug 2, 2026 20:575,54756,698,77043,735,0002,309,0002,113,536
4Aug 2, 2026 20:575,55056,280,43043,781,0002,284,0002,113,536
5Aug 2, 2026 20:575,57056,099,90943,915,0002,319,0002,113,536
6Aug 2, 2026 20:575,63257,502,68144,458,0002,288,0002,113,536
7Aug 2, 2026 20:575,63356,612,46744,514,0002,240,0002,113,536
8Aug 2, 2026 20:575,65262,327,57943,883,0003,029,0002,113,536
9Aug 2, 2026 20:575,67657,004,73944,828,0002,291,0002,113,536