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 18, 2026 01:11Elijah KinElijah KinScore: 57,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 01:1157,812505,648,890423,862,00055,981,0002,285,568
2Mar 18, 2026 01:1157,814503,848,348420,873,00058,982,0002,478,080
3Mar 18, 2026 01:1157,814502,664,023423,874,00055,983,0002,277,376
4Mar 18, 2026 01:1157,825505,381,582423,956,00055,994,0002,486,272
5Mar 18, 2026 01:1157,826504,486,465429,960,00049,995,0002,285,568
6Mar 18, 2026 01:1157,854510,665,562421,168,00059,023,0002,482,176
7Mar 18, 2026 01:1157,878509,755,930432,346,00048,038,0002,285,568
8Mar 18, 2026 01:1157,893504,341,723420,573,00059,939,0002,285,568
9Mar 18, 2026 01:1158,075509,184,378424,023,00058,003,0002,482,176