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 listJan 29, 2026 20:16truepogtruepogScore: 72,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 20:1672,691628,864,791544,304,00059,033,0002,273,280
2Jan 29, 2026 20:1672,718635,640,190546,602,00056,958,0002,277,376
3Jan 29, 2026 20:1672,966628,349,417547,653,00057,963,0002,277,376