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 listMar 26, 2026 00:49zielajzielajScore: 3,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 00:493,41248,879,97927,308,0001,011,0002,449,408
2Mar 26, 2026 00:493,41560,159,90527,335,0001,012,0002,523,136
3Mar 26, 2026 00:493,42449,596,39527,402,0001,014,0002,527,232
4Mar 26, 2026 00:493,42551,374,58327,410,0001,015,0002,445,312
5Mar 26, 2026 00:493,42656,288,92427,420,0001,015,0002,482,176
6Mar 26, 2026 00:493,42747,984,80727,427,0001,015,0002,527,232
7Mar 26, 2026 00:493,42749,055,01127,430,0001,015,0002,486,272
8Mar 26, 2026 00:493,42950,747,51727,443,0001,016,0002,433,024
9Mar 26, 2026 00:493,43154,520,35727,461,0001,017,0002,437,120
10Mar 26, 2026 00:493,43848,442,56727,513,0001,019,0002,527,232
11Mar 26, 2026 00:493,43952,940,89227,523,0001,019,0002,445,312
12Mar 26, 2026 00:493,44152,945,41927,539,0001,019,0002,523,136