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 15:14George SeabridgeGeorge SeabridgeScore: 45,979Success
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 15:1443,116368,673,658356,769,0001,098,0002,113,536
2Aug 1, 2026 15:1443,652373,849,273361,305,0001,011,0002,113,536
3Aug 1, 2026 15:1444,553379,779,181368,710,0001,081,0002,113,536
4Aug 1, 2026 15:1444,768381,558,784370,453,0001,124,0002,113,536
5Aug 1, 2026 15:1445,979391,580,606380,542,0001,084,0002,113,536
6Aug 1, 2026 15:1446,033392,061,965380,988,0001,093,0002,113,536
7Aug 1, 2026 15:1447,456403,887,773392,797,0001,088,0002,113,536
8Aug 1, 2026 15:1448,632413,640,225402,525,0001,126,0002,113,536
9Aug 1, 2026 15:1451,429436,889,012425,777,0001,091,0002,113,536