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 11:10George SeabridgeGeorge SeabridgeScore: 7,941Success
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 11:106,66065,263,49654,200,0001,084,0002,113,536
2Aug 1, 2026 11:106,68565,491,62654,406,0001,083,0002,113,536
3Aug 1, 2026 11:106,70965,682,06054,605,0001,081,0002,113,536
4Aug 1, 2026 11:107,91275,638,20064,593,0001,079,0002,113,536
5Aug 1, 2026 11:107,94175,854,34364,817,0001,095,0002,113,536
6Aug 1, 2026 11:107,94375,937,67864,825,0001,106,0002,113,536
7Aug 1, 2026 11:107,94976,130,65164,892,0001,092,0002,113,536
8Aug 1, 2026 11:107,95376,006,34664,915,0001,099,0002,113,536
9Aug 1, 2026 11:108,02876,513,12365,631,0001,007,0002,113,536