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 listDec 9, 2025 18:48hey-researcherhey-researcherScore: 2,066,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 18:482,062,79817,157,524,24617,059,252,00061,968,0002,285,568
2Dec 9, 2025 18:482,065,48617,179,937,29417,086,558,00056,975,0002,277,376
3Dec 9, 2025 18:482,066,15617,187,682,09717,076,121,00072,970,0002,277,376
4Dec 9, 2025 18:482,066,19817,179,812,65417,086,470,00062,975,0002,269,184
5Dec 9, 2025 18:482,066,45217,186,958,16317,086,580,00064,971,0002,277,376
6Dec 9, 2025 18:482,067,39717,190,834,89017,097,433,00061,965,0002,277,376
7Dec 9, 2025 18:482,069,06617,203,731,74517,107,267,00065,977,0002,277,376
8Dec 9, 2025 18:482,124,47717,665,729,52217,565,182,00067,973,0002,277,376
9Dec 9, 2025 18:482,205,96818,344,323,37118,258,558,00050,973,0002,277,376