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 listNov 1, 2026 19:11Dinu GoyalDinu GoyalScore: 66,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 19:1166,683564,378,973551,372,0002,101,0002,125,824
2Nov 1, 2026 19:1166,690564,328,526551,444,0002,090,0002,125,824
3Nov 1, 2026 19:1166,691564,447,872551,438,0002,103,0002,125,824
4Nov 1, 2026 19:1166,706565,238,003551,557,0002,107,0002,125,824
5Nov 1, 2026 19:1166,708565,119,470552,662,0001,020,0002,125,824
6Nov 1, 2026 19:1166,948566,425,628553,570,0002,104,0002,125,824
7Nov 1, 2026 19:1166,955567,225,637553,614,0002,114,0002,125,824
8Nov 1, 2026 19:1166,963566,721,755553,685,0002,108,0002,125,824
9Nov 1, 2026 19:1166,966567,305,204553,704,0002,114,0002,125,824