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 30, 2026 21:04olliecrowolliecrowScore: 10,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 21:0410,093107,843,78681,782,0001,994,0002,342,912
2Jan 30, 2026 21:0410,129107,077,75582,070,0002,001,0002,498,560
3Jan 30, 2026 21:0410,204107,375,58781,702,0002,989,0002,256,896
4Jan 30, 2026 21:0410,593111,351,68685,921,0001,998,0002,265,088
5Jan 30, 2026 21:0410,627116,970,73179,184,0009,020,0002,277,376
6Jan 30, 2026 21:0410,629116,345,22183,210,0005,012,0002,486,272
7Jan 30, 2026 21:0410,633108,617,82386,249,0002,005,0002,285,568
8Jan 30, 2026 21:0410,637113,043,13186,277,0002,006,0002,506,752
9Jan 30, 2026 21:0410,637109,155,36386,280,0002,006,0002,269,184
10Jan 30, 2026 21:0410,639110,432,24886,298,0002,006,0002,469,888
11Jan 30, 2026 21:0410,643115,804,09986,331,0002,007,0002,490,368
12Jan 30, 2026 21:0410,986113,937,65186,177,0005,010,0002,424,832