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 listNov 3, 2026 06:26Andrew EpsteinAndrew EpsteinScore: 68,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 06:2768,173575,342,648562,008,0003,836,0002,125,824stderr
2Nov 3, 2026 06:2768,224575,648,600562,680,0003,581,0002,125,824stderr
3Nov 3, 2026 06:2768,265575,817,749562,937,0003,670,0002,125,824stderr
4Nov 3, 2026 06:2768,355576,681,541563,758,0003,596,0002,125,824stderr
5Nov 3, 2026 06:2768,396577,141,155563,845,0003,843,0002,125,824stderr
6Nov 3, 2026 06:2768,501578,391,830564,961,0003,605,0002,125,824stderr
7Nov 3, 2026 06:2768,621578,952,242565,972,0003,590,0002,125,824stderr
8Nov 3, 2026 06:2768,631578,891,188566,100,0003,545,0002,125,824stderr
9Nov 3, 2026 06:2768,682579,411,025566,450,0003,614,0002,125,824stderr