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 listMay 25, 2026 20:50Maya RebholzMaya RebholzScore: 6,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:516,02161,766,87544,657,0005,325,0002,113,536
2May 25, 2026 20:516,20264,047,29246,043,0005,435,0002,117,632
3May 25, 2026 20:516,21263,401,84146,116,0005,450,0002,117,632
4May 25, 2026 20:516,28264,349,77946,518,0005,630,0002,113,536
5May 25, 2026 20:516,33663,320,44246,843,0005,746,0002,113,536
6May 25, 2026 20:516,34965,663,34747,124,0005,574,0002,117,632
7May 25, 2026 20:516,36664,639,85947,269,0005,570,0002,113,536
8May 25, 2026 20:516,36762,464,53547,319,0005,534,0002,113,536
9May 25, 2026 20:516,37665,320,46047,276,0005,651,0002,113,536