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:54George SeabridgeGeorge SeabridgeScore: 20,732Success
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:5419,472171,593,682160,543,0001,075,0002,113,536
2Aug 1, 2026 10:5419,480171,709,735160,613,0001,076,0002,113,536
3Aug 1, 2026 10:5419,513171,942,481160,881,0001,081,0002,113,536
4Aug 1, 2026 10:5419,517171,968,437160,912,0001,081,0002,113,536
5Aug 1, 2026 10:5420,732182,052,072171,001,0001,078,0002,113,536
6Aug 1, 2026 10:5420,747182,272,303171,049,0001,155,0002,113,536
7Aug 1, 2026 10:5420,757182,240,317171,193,0001,093,0002,113,536
8Aug 1, 2026 10:5420,760182,268,789171,219,0001,092,0002,113,536
9Aug 1, 2026 10:5420,768182,345,925171,280,0001,097,0002,113,536