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:08truepogtruepogScore: 71,756Success
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:0871,401614,549,480533,665,00058,963,0002,277,376
2Jan 29, 2026 20:0871,455615,573,889535,068,00058,007,0002,277,376
3Jan 29, 2026 20:0871,694615,705,585536,058,00059,006,0002,277,376
4Jan 29, 2026 20:0871,739629,905,518538,489,00056,946,0002,273,280
5Jan 29, 2026 20:0871,756638,785,894541,616,00053,961,0002,375,680
6Jan 29, 2026 20:0871,777617,899,035533,775,00061,973,0002,392,064
7Jan 29, 2026 20:0871,781620,756,616537,804,00057,978,0002,379,776
8Jan 29, 2026 20:0871,821625,078,108536,105,00060,011,0002,269,184
9Jan 29, 2026 20:0872,030629,491,209531,863,00065,983,0002,392,064