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 listSep 17, 2026 02:41Andrew EpsteinAndrew EpsteinScore: 7,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:427,44772,166,38459,781,0002,031,0002,121,728stderr
2Sep 17, 2026 02:427,47272,376,04559,984,0002,035,0002,121,728stderr
3Sep 17, 2026 02:427,49972,603,49059,957,0002,286,0002,121,728stderr
4Sep 17, 2026 02:427,52173,538,62060,372,0002,059,0002,121,728stderr
5Sep 17, 2026 02:427,58074,065,44060,686,0002,229,0002,121,728stderr
6Sep 17, 2026 02:427,61873,601,88161,197,0002,037,0002,121,728stderr
7Sep 17, 2026 02:427,62174,420,61361,223,0002,038,0002,121,728stderr
8Sep 17, 2026 02:427,64774,641,89361,439,0002,035,0002,121,728stderr
9Sep 17, 2026 02:427,64773,871,28661,444,0002,030,0002,121,728stderr