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 listNov 20, 2025 17:39NicoNicoScore: 55,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 17:3955,820488,272,032463,303,00002,273,280
2Nov 20, 2025 17:3955,823493,600,380463,331,00002,265,088
3Nov 20, 2025 17:3955,825488,834,632462,346,0001,000,0002,523,136
4Nov 20, 2025 17:3955,827489,787,856461,366,0002,001,0002,273,280
5Nov 20, 2025 17:3955,834494,096,808462,419,0001,000,0002,273,280
6Nov 20, 2025 17:3955,839495,966,302461,459,0002,001,0002,269,184
7Nov 20, 2025 17:3955,846490,779,631461,526,0001,997,0002,265,088
8Nov 20, 2025 17:3955,858493,630,640459,626,0003,996,0002,527,232
9Nov 20, 2025 17:3955,858492,212,775461,622,0001,998,0002,273,280