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 10:36Gunsoo KimGunsoo KimScore: 104,833Success
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 10:36104,690896,722,051813,930,00054,995,0002,392,064
2Dec 9, 2025 10:36104,753896,645,405810,489,00058,962,0002,396,160
3Dec 9, 2025 10:36104,827889,288,093815,058,00055,003,0002,273,280
4Dec 9, 2025 10:36104,829896,108,804811,078,00059,005,0002,404,352
5Dec 9, 2025 10:36104,833892,918,293814,110,00056,007,0002,273,280
6Dec 9, 2025 10:36104,885894,036,379806,579,00063,966,0002,408,448
7Dec 9, 2025 10:36104,907899,749,964812,748,00057,982,0002,273,280
8Dec 9, 2025 10:36105,046896,941,640812,893,00058,992,0002,510,848
9Dec 9, 2025 10:36105,089908,123,874815,221,00057,015,0002,281,472