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 21, 2026 03:56Andrew EpsteinAndrew EpsteinScore: 4,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 03:563,92340,864,50230,536,0002,032,0002,113,536
2Aug 21, 2026 03:563,96441,243,66830,828,0002,076,0002,113,536
3Aug 21, 2026 03:563,98341,390,83430,975,0002,084,0002,113,536
4Aug 21, 2026 03:564,03241,852,17831,377,0002,095,0002,113,536
5Aug 21, 2026 03:564,09542,328,40031,908,0002,082,0002,113,536
6Aug 21, 2026 03:564,10342,455,49331,962,0002,095,0002,113,536
7Aug 21, 2026 03:564,11142,489,42732,026,0002,097,0002,113,536
8Aug 21, 2026 03:564,11742,528,48232,112,0002,066,0002,113,536
9Aug 21, 2026 03:564,11842,524,10332,090,0002,091,0002,113,536