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 listFeb 17, 2026 19:02wnwnScore: 7,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:027,46290,305,99558,935,0002,996,0002,408,448
2Feb 17, 2026 19:027,48383,107,94061,105,0001,001,0002,441,216
3Feb 17, 2026 19:027,49885,749,62359,220,0003,011,0002,461,696
4Feb 17, 2026 19:027,52784,618,61960,462,0002,015,0002,392,064
5Feb 17, 2026 19:027,53498,315,70759,506,0003,025,0002,437,120
6Feb 17, 2026 19:027,55391,675,35058,706,0003,980,0002,445,312
7Feb 17, 2026 19:027,57988,798,37859,907,0002,995,0002,523,136
8Feb 17, 2026 19:027,70289,742,48960,934,0002,996,0002,424,832
9Feb 17, 2026 19:027,83088,569,99761,987,0002,999,0002,408,448