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 2, 2026 04:16Josu San MartinJosu San MartinScore: 7,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:157,38086,556,87160,249,0001,004,0002,363,392
2Jan 2, 2026 04:157,39782,213,96158,379,0003,019,0002,371,584
3Jan 2, 2026 04:167,42788,144,98861,646,00002,273,280
4Jan 2, 2026 04:157,44391,981,91560,783,000996,0002,330,624
5Jan 2, 2026 04:157,44492,906,80157,797,0003,986,0002,502,656
6Jan 2, 2026 04:157,44788,122,84159,813,0001,993,0002,478,080
7Jan 2, 2026 04:167,45488,796,72854,882,0006,985,0002,359,296
8Jan 2, 2026 04:167,48387,047,74160,103,0002,003,0002,445,312
9Jan 2, 2026 04:167,56288,527,75959,774,0002,988,0002,367,488
10Jan 2, 2026 04:167,58490,644,48060,949,0001,998,0002,334,720
11Jan 2, 2026 04:157,62785,269,34257,274,0006,028,0002,445,312
12Jan 2, 2026 04:167,63785,023,18561,379,0002,012,0002,285,568